Learning with errors

Results: 81



#Item
31Cryptography from Post-Quantum Assumptions Raza Ali Kazmi Doctor of Philosophy

Cryptography from Post-Quantum Assumptions Raza Ali Kazmi Doctor of Philosophy

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-04-18 18:23:29
32Detecting Multiple Mean Breaks At Unknown Points With Atheoretical Regression Trees

Detecting Multiple Mean Breaks At Unknown Points With Atheoretical Regression Trees

Add to Reading List

Source URL: www.mssanz.org.au

Language: English - Date: 2013-01-15 17:46:53
33Oblivious Transfer from weakly Random Self-Reducible Public-Key Cryptosystem Claude Cr´epeau ? , Raza Ali Kazmi  ?

Oblivious Transfer from weakly Random Self-Reducible Public-Key Cryptosystem Claude Cr´epeau ? , Raza Ali Kazmi ?

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-04-21 15:33:43
34

PDF Document

Add to Reading List

Source URL: csrc.nist.gov

Language: English - Date: 2015-04-02 11:19:07
35On Ideal Lattices and Learning with Errors Over Rings∗ Vadim Lyubashevsky† Chris Peikert‡

On Ideal Lattices and Learning with Errors Over Rings∗ Vadim Lyubashevsky† Chris Peikert‡

Add to Reading List

Source URL: www.cims.nyu.edu

Language: English - Date: 2012-04-24 16:40:38
36The Learning with Errors Problem Oded Regev∗ Abstract In this survey we describe the Learning with Errors (LWE) problem, discuss its properties, its hardness, and its cryptographic applications.

The Learning with Errors Problem Oded Regev∗ Abstract In this survey we describe the Learning with Errors (LWE) problem, discuss its properties, its hardness, and its cryptographic applications.

Add to Reading List

Source URL: www.cims.nyu.edu

Language: English - Date: 2010-06-01 03:43:39
37Simple Chosen-Ciphertext Security from Low-Noise LPN Eike Kiltz1? , Daniel Masny1?? , Krzysztof Pietrzak2? ? ? 1  Horst-G¨

Simple Chosen-Ciphertext Security from Low-Noise LPN Eike Kiltz1? , Daniel Masny1?? , Krzysztof Pietrzak2? ? ? 1 Horst-G¨

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-04-28 02:59:10
38The nc-Unique Shortest Vector Problem is Hard Vadim Lyubashevsky∗ Abstract The unique Shortest Vector Problem (uSVP) gained prominence because it was the problem upon which the first provably-secure lattice-based crypt

The nc-Unique Shortest Vector Problem is Hard Vadim Lyubashevsky∗ Abstract The unique Shortest Vector Problem (uSVP) gained prominence because it was the problem upon which the first provably-secure lattice-based crypt

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2008-12-01 09:32:36
39Lattice Decoding Attacks on Binary LWE Shi Bai and Steven D. Galbraith Department of Mathematics, University of Auckland, New Zealand.

Lattice Decoding Attacks on Binary LWE Shi Bai and Steven D. Galbraith Department of Mathematics, University of Auckland, New Zealand.

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-04-24 04:32:29
40Better Key Sizes (and Attacks) for LWE-Based Encryption Richard Lindner∗ Chris Peikert†

Better Key Sizes (and Attacks) for LWE-Based Encryption Richard Lindner∗ Chris Peikert†

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2010-11-30 13:28:50